0.08/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.11	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.10/0.31	% Computer : n018.cluster.edu
0.10/0.31	% Model    : x86_64 x86_64
0.10/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory   : 8042.1875MB
0.10/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 1920
0.10/0.31	% WCLimit    : 240
0.10/0.31	% DateTime   : Wed Jul 30 08:51:34 EDT 2025
0.10/0.31	% CPUTime    : 
0.16/0.43	Running higher-order theorem proving
4.56/4.75	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.exmm2Yt35J/E---3.1_16865.p
61.39/20.02	# Version: 3.0.0-ho
61.39/20.02	# partial match(2): HMLMSMSMSSLCHFA
61.39/20.02	# Preprocessing class: HMLLSMLMSSLCHFA.
61.39/20.02	# Scheduled 4 strats onto 8 cores with 239 seconds (1912 total)
61.39/20.02	# Starting new_ho_10 with 1195s (5) cores
61.39/20.02	# Starting sh5l with 239s (1) cores
61.39/20.02	# Starting new_bool_1 with 239s (1) cores
61.39/20.02	# Starting new_bool_2 with 239s (1) cores
61.39/20.02	# new_bool_2 with pid 16971 completed with status 0
61.39/20.02	# Result found by new_bool_2
61.39/20.02	# partial match(2): HMLMSMSMSSLCHFA
61.39/20.02	# Preprocessing class: HMLLSMLMSSLCHFA.
61.39/20.02	# Scheduled 4 strats onto 8 cores with 239 seconds (1912 total)
61.39/20.02	# Starting new_ho_10 with 1195s (5) cores
61.39/20.02	# Starting sh5l with 239s (1) cores
61.39/20.02	# Starting new_bool_1 with 239s (1) cores
61.39/20.02	# Starting new_bool_2 with 239s (1) cores
61.39/20.02	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
61.39/20.02	# Search class: HGHSM-SMLM32-DHFFFSBN
61.39/20.02	# Scheduled 5 strats onto 1 cores with 238 seconds (238 total)
61.39/20.02	# Starting new_ho_10 with 143s (1) cores
61.39/20.02	# new_ho_10 with pid 16972 completed with status 0
61.39/20.02	# Result found by new_ho_10
61.39/20.02	# partial match(2): HMLMSMSMSSLCHFA
61.39/20.02	# Preprocessing class: HMLLSMLMSSLCHFA.
61.39/20.02	# Scheduled 4 strats onto 8 cores with 239 seconds (1912 total)
61.39/20.02	# Starting new_ho_10 with 1195s (5) cores
61.39/20.02	# Starting sh5l with 239s (1) cores
61.39/20.02	# Starting new_bool_1 with 239s (1) cores
61.39/20.02	# Starting new_bool_2 with 239s (1) cores
61.39/20.02	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
61.39/20.02	# Search class: HGHSM-SMLM32-DHFFFSBN
61.39/20.02	# Scheduled 5 strats onto 1 cores with 238 seconds (238 total)
61.39/20.02	# Starting new_ho_10 with 143s (1) cores
61.39/20.02	# Preprocessing time       : 0.217 s
61.39/20.02	# Presaturation interreduction done
61.39/20.02	
61.39/20.02	# Proof found!
61.39/20.02	# SZS status Theorem
61.39/20.02	# SZS output start CNFRefutation
61.39/20.02	thf(decl_sort1, type, num: $tType).
61.39/20.02	thf(decl_sort2, type, nat: $tType).
61.39/20.02	thf(decl_319, type, one_one_nat: nat).
61.39/20.02	thf(decl_566, type, suc: nat > nat).
61.39/20.02	thf(decl_630, type, bit0: num > num).
61.39/20.02	thf(decl_632, type, one: num).
61.39/20.02	thf(decl_640, type, numeral_numeral_nat: num > nat).
61.39/20.02	thf(decl_680, type, ord_less_nat: nat > nat > $o).
61.39/20.02	thf(decl_695, type, ord_less_eq_nat: nat > nat > $o).
61.39/20.02	thf(decl_743, type, power_power_nat: nat > nat > nat).
61.39/20.02	thf(decl_1088, type, deg: nat).
61.39/20.02	thf(decl_1090, type, ma: nat).
61.39/20.02	thf(decl_1091, type, mi: nat).
61.39/20.02	thf(decl_1095, type, x: nat).
61.39/20.02	thf(fact_412_order__less__asym_H, axiom, ![X61:nat, X62:nat]:((~((ord_less_nat @ X62 @ X61))<=(ord_less_nat @ X61 @ X62))), file('/export/starexec/sandbox/tmp/tmp.exmm2Yt35J/E---3.1_16865.p', fact_412_order__less__asym_H)).
61.39/20.02	thf(fact_1__C5_Ohyps_C_I8_J, axiom, (ord_less_nat @ ma @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), file('/export/starexec/sandbox/tmp/tmp.exmm2Yt35J/E---3.1_16865.p', fact_1__C5_Ohyps_C_I8_J)).
61.39/20.02	thf(fact_2973_Suc__1, axiom, ((suc @ one_one_nat)=(numeral_numeral_nat @ (bit0 @ one))), file('/export/starexec/sandbox/tmp/tmp.exmm2Yt35J/E---3.1_16865.p', fact_2973_Suc__1)).
61.39/20.02	thf(fact_602_dual__order_Ostrict__trans1, axiom, ![X8827:nat, X8828:nat, X8829:nat]:(((ord_less_eq_nat @ X8827 @ X8828)=>((ord_less_nat @ X8829 @ X8827)=>(ord_less_nat @ X8829 @ X8828)))), file('/export/starexec/sandbox/tmp/tmp.exmm2Yt35J/E---3.1_16865.p', fact_602_dual__order_Ostrict__trans1)).
61.39/20.02	thf(fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062, axiom, ((ord_less_eq_nat @ x @ ma)&(ord_less_eq_nat @ mi @ x)), file('/export/starexec/sandbox/tmp/tmp.exmm2Yt35J/E---3.1_16865.p', fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062)).
61.39/20.02	thf(fact_346_antisym__conv3, axiom, ![X4186:nat, X4187:nat]:((~((ord_less_nat @ X4186 @ X4187))=>(~((ord_less_nat @ X4187 @ X4186))<=>((X4187)=(X4186))))), file('/export/starexec/sandbox/tmp/tmp.exmm2Yt35J/E---3.1_16865.p', fact_346_antisym__conv3)).
61.39/20.02	thf(conj_0, conjecture, (ord_less_nat @ x @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), file('/export/starexec/sandbox/tmp/tmp.exmm2Yt35J/E---3.1_16865.p', conj_0)).
61.39/20.02	thf(fact_512_leD, axiom, ![X4241:nat, X4242:nat]:((~((ord_less_nat @ X4242 @ X4241))<=(ord_less_eq_nat @ X4241 @ X4242))), file('/export/starexec/sandbox/tmp/tmp.exmm2Yt35J/E---3.1_16865.p', fact_512_leD)).
61.39/20.02	thf(c_0_8, plain, ![X61:nat, X62:nat]:(((ord_less_nat @ X61 @ X62)=>~(ord_less_nat @ X62 @ X61))), inference(fof_simplification,[status(thm)],[fact_412_order__less__asym_H])).
61.39/20.02	thf(c_0_9, plain, ![X27568:nat, X27569:nat]:((~(ord_less_nat @ X27568 @ X27569)|~(ord_less_nat @ X27569 @ X27568))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])).
61.39/20.02	thf(c_0_10, plain, (ord_less_nat @ ma @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), inference(split_conjunct,[status(thm)],[fact_1__C5_Ohyps_C_I8_J])).
61.39/20.02	thf(c_0_11, plain, ((suc @ one_one_nat)=(numeral_numeral_nat @ (bit0 @ one))), inference(split_conjunct,[status(thm)],[fact_2973_Suc__1])).
61.39/20.02	thf(c_0_12, plain, ![X27745:nat, X27746:nat, X27747:nat]:((~(ord_less_eq_nat @ X27745 @ X27746)|(~(ord_less_nat @ X27747 @ X27745)|(ord_less_nat @ X27747 @ X27746)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_602_dual__order_Ostrict__trans1])])).
61.39/20.02	thf(c_0_13, plain, ![X18:nat, X4:nat]:((~((ord_less_nat @ X4 @ X18))|~((ord_less_nat @ X18 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_9])).
61.39/20.02	thf(c_0_14, plain, (ord_less_nat @ ma @ (power_power_nat @ (suc @ one_one_nat) @ deg)), inference(rw,[status(thm)],[c_0_10, c_0_11])).
61.39/20.02	thf(c_0_15, plain, ![X19:nat, X18:nat, X4:nat]:(((ord_less_nat @ X19 @ X18)|~((ord_less_eq_nat @ X4 @ X18))|~((ord_less_nat @ X19 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_12])).
61.39/20.02	thf(c_0_16, plain, (ord_less_eq_nat @ x @ ma), inference(split_conjunct,[status(thm)],[fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062])).
61.39/20.02	thf(c_0_17, plain, ![X4186:nat, X4187:nat]:((~(ord_less_nat @ X4186 @ X4187)=>(~(ord_less_nat @ X4187 @ X4186)<=>((X4187)=(X4186))))), inference(fof_simplification,[status(thm)],[fact_346_antisym__conv3])).
61.39/20.02	thf(c_0_18, negated_conjecture, ~(ord_less_nat @ x @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
61.39/20.02	thf(c_0_19, plain, ![X4241:nat, X4242:nat]:(((ord_less_eq_nat @ X4241 @ X4242)=>~(ord_less_nat @ X4242 @ X4241))), inference(fof_simplification,[status(thm)],[fact_512_leD])).
61.39/20.02	thf(c_0_20, plain, ~((ord_less_nat @ (power_power_nat @ (suc @ one_one_nat) @ deg) @ ma)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
61.39/20.02	thf(c_0_21, plain, ![X4:nat]:(((ord_less_nat @ X4 @ ma)|~((ord_less_nat @ X4 @ x)))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
61.39/20.02	thf(c_0_22, plain, ![X27650:nat, X27651:nat]:((((ord_less_nat @ X27651 @ X27650)|((X27651)=(X27650))|(ord_less_nat @ X27650 @ X27651))&(((X27651)!=(X27650))|~(ord_less_nat @ X27651 @ X27650)|(ord_less_nat @ X27650 @ X27651)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])).
61.39/20.02	thf(c_0_23, negated_conjecture, ~((ord_less_nat @ x @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg))), inference(split_conjunct,[status(thm)],[c_0_18])).
61.39/20.02	thf(c_0_24, plain, ![X27652:nat, X27653:nat]:((~(ord_less_eq_nat @ X27652 @ X27653)|~(ord_less_nat @ X27653 @ X27652))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])).
61.39/20.02	thf(c_0_25, plain, ~((ord_less_nat @ (power_power_nat @ (suc @ one_one_nat) @ deg) @ x)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
61.39/20.02	thf(c_0_26, plain, ![X18:nat, X4:nat]:(((ord_less_nat @ X4 @ X18)|((X4)=(X18))|(ord_less_nat @ X18 @ X4))), inference(split_conjunct,[status(thm)],[c_0_22])).
61.39/20.02	thf(c_0_27, negated_conjecture, ~((ord_less_nat @ x @ (power_power_nat @ (suc @ one_one_nat) @ deg))), inference(rw,[status(thm)],[c_0_23, c_0_11])).
61.39/20.02	thf(c_0_28, plain, ![X18:nat, X4:nat]:((~((ord_less_eq_nat @ X4 @ X18))|~((ord_less_nat @ X18 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_24])).
61.39/20.02	thf(c_0_29, plain, ((power_power_nat @ (suc @ one_one_nat) @ deg)=(x)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])).
61.39/20.02	thf(c_0_30, plain, ~((ord_less_nat @ ma @ x)), inference(spm,[status(thm)],[c_0_28, c_0_16])).
61.39/20.02	thf(c_0_31, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_29]), c_0_30]), ['proof']).
61.39/20.02	# SZS output end CNFRefutation
61.39/20.02	# Parsed axioms                        : 11424
61.39/20.02	# Removed by relevancy pruning/SinE    : 7988
61.39/20.02	# Initial clauses                      : 8965
61.39/20.02	# Removed in clause preprocessing      : 1956
61.39/20.02	# Initial clauses in saturation        : 7009
61.39/20.02	# Processed clauses                    : 12938
61.39/20.02	# ...of these trivial                  : 338
61.39/20.02	# ...subsumed                          : 3249
61.39/20.02	# ...remaining for further processing  : 9351
61.39/20.02	# Other redundant clauses eliminated   : 2062
61.39/20.02	# Clauses deleted for lack of memory   : 0
61.39/20.02	# Backward-subsumed                    : 74
61.39/20.02	# Backward-rewritten                   : 124
61.39/20.02	# Generated clauses                    : 80128
61.39/20.02	# ...of the previous two non-redundant : 67922
61.39/20.02	# ...aggressively subsumed             : 0
61.39/20.02	# Contextual simplify-reflections      : 99
61.39/20.02	# Paramodulations                      : 77990
61.39/20.02	# Factorizations                       : 14
61.39/20.02	# NegExts                              : 0
61.39/20.02	# Equation resolutions                 : 2121
61.39/20.02	# Disequality decompositions           : 0
61.39/20.02	# Total rewrite steps                  : 32651
61.39/20.02	# ...of those cached                   : 28372
61.39/20.02	# Propositional unsat checks           : 0
61.39/20.02	#    Propositional check models        : 0
61.39/20.02	#    Propositional check unsatisfiable : 0
61.39/20.02	#    Propositional clauses             : 0
61.39/20.02	#    Propositional clauses after purity: 0
61.39/20.02	#    Propositional unsat core size     : 0
61.39/20.02	#    Propositional preprocessing time  : 0.000
61.39/20.02	#    Propositional encoding time       : 0.000
61.39/20.02	#    Propositional solver time         : 0.000
61.39/20.02	#    Success case prop preproc time    : 0.000
61.39/20.02	#    Success case prop encoding time   : 0.000
61.39/20.02	#    Success case prop solver time     : 0.000
61.39/20.02	# Current number of processed clauses  : 3287
61.39/20.02	#    Positive orientable unit clauses  : 818
61.39/20.02	#    Positive unorientable unit clauses: 42
61.39/20.02	#    Negative unit clauses             : 319
61.39/20.02	#    Non-unit-clauses                  : 2108
61.39/20.02	# Current number of unprocessed clauses: 66633
61.39/20.02	# ...number of literals in the above   : 187255
61.39/20.02	# Current number of archived formulas  : 0
61.39/20.02	# Current number of archived clauses   : 5016
61.39/20.02	# Clause-clause subsumption calls (NU) : 12870342
61.39/20.02	# Rec. Clause-clause subsumption calls : 1562268
61.39/20.02	# Non-unit clause-clause subsumptions  : 1866
61.39/20.02	# Unit Clause-clause subsumption calls : 136299
61.39/20.02	# Rewrite failures with RHS unbound    : 0
61.39/20.02	# BW rewrite match attempts            : 1641
61.39/20.02	# BW rewrite match successes           : 540
61.39/20.02	# Condensation attempts                : 12938
61.39/20.02	# Condensation successes               : 46
61.39/20.02	# Termbank termtop insertions          : 3638454
61.39/20.02	# Search garbage collected termcells   : 188178
61.39/20.02	
61.39/20.02	# -------------------------------------------------
61.39/20.02	# User time                : 13.634 s
61.39/20.02	# System time              : 0.201 s
61.39/20.02	# Total time               : 13.835 s
61.39/20.02	# Maximum resident set size: 49356 pages
61.39/20.02	
61.39/20.02	# -------------------------------------------------
61.39/20.02	# User time                : 14.941 s
61.39/20.02	# System time              : 0.230 s
61.39/20.02	# Total time               : 15.171 s
61.39/20.02	# Maximum resident set size: 27820 pages
61.39/20.02	% E exiting
61.39/20.03	% E exiting
61.39/20.03	EOF